Multiobjective Optimization
نویسنده
چکیده
return on his or her investment with a small risk of incurring a loss; an oncologist prescribes radiotherapy to a cancer patient so as to destroy the tumor without causing damage to healthy organs; an airline manager constructs schedules that incur small salary costs and that ensure smooth operation even in the case of disruptions. All three decision makers (DMs) are in a similar situation—they need to make a decision trying to achieve several conflicting goals at the same time: The highest return investments are in general the riskiest ones, tumors can always be destroyed at the expense of irreversible damage to healthy organs, and the cheapest schedules to operate are ones that leave as little as possible time between flights, wreaking havoc to operations in the case of unexpected delays. Moreover, the investor, the oncologist, and the airline manager are all in a situation where the number of available options or alternatives is very large or even infinite. There are infinitely many ways to invest money and infinitely many possible radiotherapy treatments, but the number of feasible crew schedules is finite, albeit astronomical in practice. The alternatives are therefore described by constraints, rather than explicitly known: the sums invested in every stock must equal the total invested; the radiotherapy treatment must meet physical and clinical constraints; crew schedules must ensure that each flight has exactly one crew assigned to operate it. Mathematically, the alternatives are described by vectors in variable or decision space; the set of all vectors satisfying the constraints is called the feasible set in decision space. The consequences or attributes of the alternatives are described as vectors in objective or outcome space, where outcome (objective) vectors are a function of the decision (variable) vectors. The set of outcomes corresponding to feasible alternatives is called Articles
منابع مشابه
Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملAn algorithm for approximating nondominated points of convex multiobjective optimization problems
In this paper, we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP), where the constraints and the objective functions are convex. We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points. The proposed algorithm can be appl...
متن کاملXergy analysis and multiobjective optimization of a biomass gasification-based multigeneration system
Biomass gasification is the process of converting biomass into a combustible gas suitable for use in boilers, engines, and turbines to produce combined cooling, heat, and power. This paper presents a detailed model of a biomass gasification system and designs a multigeneration energy system that uses the biomass gasification process for generating combined cooling, heat, and electricity. Energy...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملImprovement of Methanol Synthesis Process by using a Novel Sorption-Enhanced Fluidized-bed Reactor, Part II: Multiobjective Optimization and Decision-making Method
In the first part (Part I) of this study, a novel fluidized bed reactor was modeled mathematically for methanol synthesis in the presence of in-situ water adsorbent named Sorption Enhanced Fluidized-bed Reactor (SE-FMR) is modeled, mathematically. Here, the non-dominated sorting genetic algorithm-II (NSGA-II) is applied for multi-objective optimization of this configuration. Inlet temperature o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- AI Magazine
دوره 29 شماره
صفحات -
تاریخ انتشار 2008